A Nonlinear Lagrangian Approach to Constrained Optimization Problems

نویسندگان

  • X. Q. Yang
  • X. X. Huang
چکیده

In this paper we study nonlinear Lagrangian functions for constrained optimization problems which are, in general, nonlinear with respect to the objective function. We establish an equivalence between two types of zero duality gap properties, which are described using augmented Lagrangian dual functions and nonlinear Lagrangian dual functions, respectively. Furthermore, we show the existence of a path of optimal solutions generated by nonlinear Lagrangian problems and show its convergence toward the optimal set of the original problem. We analyze the convergence of several classes of nonlinear Lagrangian problems in terms of their first and second order necessary optimality conditions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems

Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...

متن کامل

Trim and Maneuverability Analysis Using a New Constrained PSO Approach of a UAV

Performance characteristic of an Unmanned Air Vehicle (UAV) is investigated using a newly developed heuristic approach. Almost all flight phases of any air vehicle can be categorized into trim and maneuvering flights. In this paper, a new envelope called trim-ability envelope, is introduced and sketched within the conventional flight envelope for a small UAV. Optimal maneuverability of the inte...

متن کامل

Superlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis

We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...

متن کامل

OPTIMAL CONSTRAINED DESIGN OF STEEL STRUCTURES BY DIFFERENTIAL EVOLUTIONARY ALGORITHMS

Structural optimization, when approached by conventional (gradient based) minimization algorithms presents several difficulties, mainly related to computational aspects for the huge number of nonlinear analyses required, that regard both Objective Functions (OFs) and Constraints. Moreover, from the early '80s to today's, Evolutionary Algorithms have been successfully developed and applied as a ...

متن کامل

An Efficient Neurodynamic Scheme for Solving a Class of Nonconvex Nonlinear Optimization Problems

‎By p-power (or partial p-power) transformation‎, ‎the Lagrangian function in nonconvex optimization problem becomes locally convex‎. ‎In this paper‎, ‎we present a neural network based on an NCP function for solving the nonconvex optimization problem‎. An important feature of this neural network is the one-to-one correspondence between its equilibria and KKT points of the nonconvex optimizatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM Journal on Optimization

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2001